Effective category and measure in abstract complexity theory
نویسندگان
چکیده
منابع مشابه
Effective Category and Measure in Abstract Complexity Theory (Extended Abstract)
Strong variants of the Operator Speed-up Theorem, Operator Gap Theorem and Compression Theorem are obtained using an effective version of Baire Category Theorem. It is also shown that all complexity classes of recursive predicates have effective measure zero in the space of recursive predicates and, on the other hand, the class of predicates with almost everywhere complexity above an arbitrary ...
متن کاملMeasure, Category and Learning Theory
Measure and category (or rather, their recursion theoretical counterparts) have been used in Theoretical Computer Science to make precise the intuitive notion \for most of the recursive sets." We use the notions of eeective measure and category to discuss the relative sizes of inferrible sets, and their complements. We nd that inferrible sets become large rather quickly in the standard hierarch...
متن کاملChaos/Complexity Theory and Education
Sciences exist to demonstrate the fundamental order underlying nature. Chaos/complexity theory is a novel and amazing field of scientific inquiry. Notions of our everyday experiences are somehow in connection to the laws of nature through chaos/complexity theory’s concerns with the relationships between simplicity and complexity, between orderliness and randomness (Retrieved from http://www.inc...
متن کاملCategory Theory: an abstract setting for analogy and comparison
‘Comparison’ and ‘Analogy’ are fundamental aspects of knowledge acquisition. We argue that one of the reasons for the usefulness and importance of Category Theory is that it gives an abstract mathematical setting for analogy and comparison, allowing an analysis of the process of abstracting and relating new concepts. This setting is one of the most important routes for the application of Mathem...
متن کاملQuestions and Answers — a Category Arising in Linear Logic , Complexity Theory , and Set Theory
A category used by de Paiva to model linear logic also occurs in Vojtáš’s analysis of cardinal characteristics of the continuum. Its morphisms have been used in describing reductions between search problems in complexity theory. We describe this category and how it arises in these various contexts. We also show how these contexts suggest certain new multiplicative connectives for linear logic. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1996
ISSN: 0304-3975
DOI: 10.1016/0304-3975(95)00066-6